package com.study.leetcode;
//https://leetcode.cn/problems/missing-number/
public class Solution_268 {
    public int missingNumber(int[] nums) {
        int res = nums.length;
        for(int i=0;i<nums.length;i++){
            res  = res^ nums[i];
            res  = res^ i;
        }
        return res;
    }
}
